Deterministic Quantum Annealing Expectation-Maximization Algorithm

Maximum likelihood estimation (MLE) is one of the most important methods in machine learning, and the expectation-maximization (EM) algorithm is often used to obtain maximum likelihood estimates. However, EM heavily depends on initial configurations and fails to find the global optimum. On the other hand, in the field of physics, quantum annealing (QA) was proposed as a novel optimization approach. Motivated by QA, we propose a quantum annealing extension of EM, which we call the deterministic quantum annealing expectation-maximization (DQAEM) algorithm. We also discuss its advantage in terms of the path integral formulation. Furthermore, by employing numerical simulations, we illustrate how it works in MLE and show that DQAEM outperforms EM. PACS numbers: 03.67.-a, 03.67.Ac, 89.90.+n, 89.70.-a, 89.20.-a ar X iv :1 70 4. 05 82 2v 1 [ st at .M L ] 1 9 A pr 2 01 7 Deterministic Quantum Annealing Expectation-Maximization Algorithm 2